Computation of Steady-State Probability Distributions in Stochastic Models of Cellular Networks
نویسندگان
چکیده
Cellular processes are "noisy". In each cell, concentrations of molecules are subject to random fluctuations due to the small numbers of these molecules and to environmental perturbations. While noise varies with time, it is often measured at steady state, for example by flow cytometry. When interrogating aspects of a cellular network by such steady-state measurements of network components, a key need is to develop efficient methods to simulate and compute these distributions. We describe innovations in stochastic modeling coupled with approaches to this computational challenge: first, an approach to modeling intrinsic noise via solution of the chemical master equation, and second, a convolution technique to account for contributions of extrinsic noise. We show how these techniques can be combined in a streamlined procedure for evaluation of different sources of variability in a biochemical network. Evaluation and illustrations are given in analysis of two well-characterized synthetic gene circuits, as well as a signaling network underlying the mammalian cell cycle entry.
منابع مشابه
Asynchronous Stochastic Boolean Networks as Gene Network Models
Logical models have widely been used to gain insights into the biological behavior of gene regulatory networks (GRNs). Most logical models assume a synchronous update of the genes' states in a GRN. However, this may not be appropriate, because each gene may require a different period of time for changing its state. In this article, asynchronous stochastic Boolean networks (ASBNs) are proposed f...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملIncremental adaptive networks implemented by free space optical (FSO) communication
The aim of this paper is to fully analyze the effects of free space optical (FSO) communication links on the estimation performance of the adaptive incremental networks. The FSO links in this paper are described with two turbulence models namely the Log-normal and Gamma-Gamma distributions. In order to investigate the impact of these models we produced the link coefficients using these distribu...
متن کاملA Numerical Scheme for Invariant Distributions of Constrained Diffusions
Reflected diffusions in polyhedral domains are commonly used as approximate models for stochastic processing networks in heavy traffic. Stationary distributions of such models give useful information on the steady state performance of the corresponding stochastic networks and thus it is important to develop reliable and efficient algorithms for numerical computation of such distributions. In th...
متن کامل